翻訳と辞書 Words near each other ・ Super-Toys Last All Summer Long ・ Super-Turtle ・ Super-twisted nematic display ・ SUPER-UX ・ Super-Villain Team-Up ・ Super/System ・ Super16 (film school) ・ Super3 ・ Super7 ・ Super7 (band) ・ Super8 & Tab ・ Super8 (musical group) ・ Super8 Mundialito Beach Soccer Tournament ・ Superabsorbent polymer ・ Superabundance ・ Superabundant number ・ Superachromat ・ Superacid ・ Superact ・ Superadditive developer ・ Superadditive set function ・ Superadditivity ・ Superadobe ・ Superagnia fuchsi ・ Superagonist ・ Superagui lion tamarin ・ Superagüi National Park ・ Superalgebra ・ Superalloy ・ SuperAmerica Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Superabundant number ： ウィキペディア英語版 Superabundant number In mathematics, a superabundant number (sometimes abbreviated as SA) is a certain kind of natural number. A natural number ''n'' is called superabundant precisely when, for all ''m'' < ''n'', : where ''σ'' denotes the sum-of-divisors function (i.e., the sum of all positive divisors of ''n'', including ''n'' itself). The first few superabundant numbers are 1, 2, 4, 6, 12, 24, 36, 48, 60, 120, ... . Superabundant numbers were defined by . Unknown to Alaoglu and Erdős, about 30 pages of Ramanujan's 1915 paper "Highly Composite Numbers" were suppressed. Those pages were finally published in The Ramanujan Journal 1 (1997), 119–153. In section 59 of that paper, Ramanujan defines generalized highly composite numbers, which include the superabundant numbers. == Properties == proved that if ''n'' is superabundant, then there exist a ''k'' and ''a''i, ''a''2, ..., ''a''''k'' such that :$n=\backslash prod\_^k\; (p\_i)^$ where ''p''i is the ''i''-th prime number, and :$a\_1\backslash geq\; a\_2\backslash geq\backslash dotsb\backslash geq\; a\_k\backslash geq\; 1.$ That is, they proved that if ''n'' is superabundant, the prime decomposition of ''n'' has non-increasing exponents (the exponent of a larger prime is never more than that a smaller prime) and that all primes up to $p\_k$ are factors of ''n''. Then in particular any superabundant number is an even integer, and it is a multiple of the ''k''-th primorial $p\_k\backslash \#.$ In fact, the last exponent ''a''''k'' is equal to 1 except when n is 4 or 36. Superabundant numbers are closely related to highly composite numbers. Not all superabundant numbers are highly composite numbers. In fact, only 449 superabundant and highly composite numbers are the same. For instance, 7560 is highly composite but not superabundant. Alaoglu and Erdős observed that all superabundant numbers are highly abundant. Not all superabundant numbers are Harshad numbers. The first exception is the 105th SA number, 149602080797769600. The digit sum is 81, but 81 does not divide evenly into this SA number. Superabundant numbers are also of interest in connection with the Riemann hypothesis, and with Robin's theorem that the Riemann hypothesis is equivalent to the statement that : for all ''n'' greater than the largest known exception, the superabundant number 5040. If this inequality has a larger counterexample, proving the Riemann hypothesis to be false, the smallest such counterexample must be a superabundant number . 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Superabundant number」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.